Balanced-Budget Mechanisms with Incomplete Information
نویسندگان
چکیده
We examine mechanism design with transferable utility and budget balance, using techniques we developed for the study of repeated games. We show that with independent types, budget balance does not limit the set of social choice functions that can be implemented. With correlated types and three or more players, budget balance is again not a constraint if no player has "too many" more possible types than any other player. Moreover, in the latter case, for generic probability distributions over types all social choice functions are implementable. © This document is copyrighted by the authors. You may freely reproduce and distribute it electronically or in print, provided it is distributed in its entirety, including this copyright notice. * We are grateful to Jacques Crémer for helpful comments, Pietro Veronesi for careful proofreading, and National Science Foundation Grants SBR 92-23320, 93-20695, and (Eric’s) for financial support, ** Departments of Economics, Harvard, UCLA and Harvard.
منابع مشابه
Implementing the Efficient Allocation of Pollution
We provide simple mechanisms to implement the efficient allocation of pollution, first assuming complete information across firms and then allowing for incomplete information. Both mechanisms operate by inducing firms to monitor one another, using firms’ reports to determine pollution allotments and transfers. The complete information mechanism determines a firm’s transfer according to a linear...
متن کاملThe Combinatorial Seller’s Bid Double Auction: An Asymptotically Efficient Market Mechanism*
We consider the problem of efficient mechanism design for multilateral trading of multiple goods with independent private types for players and incomplete information among them. The problem is partly motivated by an efficient resource allocation problem in communication networks where there are both buyers and sellers. In such a setting, ex post budget balance and individual rationality are ke...
متن کاملEconomic Mechanisms for Shortest Path Cooperative Games with Incomplete Information
In this paper we present a cooperative game theoretic interpretation of the shortest path problem. We consider a buying agent who has a budget to go from a specified source node s to a specified target node t in a directed acyclic network. The budget may reflect the level of utility that he associates in going from node s to node t. The edges in the network are owned by individual utility maxim...
متن کاملRobust Trading Mechanisms with Budget Surplus and Partial Trade
In a bilateral bargaining problem with private values, Hagerty and Rogerson (1987) showed that essentially all dominant strategy incentive compatible, ex post individually rational, and budget balanced mechanisms are posted-price mechanisms, where a price is drawn from a distribution, and trade occurs if both players benefit from trading at this price. We relax budget balancedness to feasibilit...
متن کاملOvercoming Participation Constraints
In incomplete information environments with transferable utility, efficient outcomes are generally implementable unless interim or ex post participation constraints are imposed on the problem. In this paper we show that linking a sufficiently large number of independent but possibly unrelated social decisions, a slightly perturbed Groves mechanism can implement an efficient outcome with probabi...
متن کامل